Fault-Tolerant Resolvability and Extremal Structures of Graphs
نویسندگان
چکیده
منابع مشابه
Fault-Tolerant Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a constant fraction of errors. This model is the common generalization of (static) data structures and locally decodable error-correcting codes. The m...
متن کاملFault Tolerant Data Structures
We consider the tolerance of data structures to memory faults. We observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. In this paper we present a formal framework for studying the fault tolerance properties of pointer-based data structures, and...
متن کاملRealizability of Fault Tolerant Graphs∗
A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....
متن کاملFault-Tolerant Graphs for Tori
Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H , construct a graph G from H by adding a minimum number D( t , H ) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate D( t , H ) for the torus, which is well known ...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7010078